On Robustness Analysis of a Dynamic Average Consensus Algorithm to Communication Delay
نویسندگان
چکیده
منابع مشابه
Average consensus on networks with quantized communication
This work presents a contribution to the solution of the average agreement problem on a network with quantized links. Starting from the well-known linear diffusion algorithm, we propose a simple and effective adaptation which is able to preserve the average of states and to drive the system near to the consensus value, when a uniform quantization is applied to communication between agents. The ...
متن کاملA probabilistic analysis of the average consensus algorithm with quantized communication
In the average consensus problem the states of a set of agents, linked according to a directed graph, have to be driven to their average. When the communication between neighbors is uniformly quantized, such a problem can not be exactly solved by a linear time-invariant algorithm. In this work, we propose a probabilistic estimate of the error from the agreement, in terms of the eigenvalues of t...
متن کاملDiscrete-time dynamic average consensus
Wepropose a class of discrete-time dynamic average consensus algorithms that allow a group of agents to track the average of their reference inputs. The convergence results rely on the input-to-output stability properties of static average consensus algorithms and require that the union of communication graphs over a bounded period of time be strongly connected. The only requirement on the set ...
متن کاملAnalysis of Response Robustness for a Multi-Objective Mathematical Model of Dynamic Cellular Manufacturing
The multi-objective optimization problem is the main purpose of generating an optimal set of targets known as Pareto optimal frontier to be provided the ultimate decision-makers. The final selection of point of Pareto frontier is usually made only based on the goals presented in the mathematical model to implement the considered system by the decision-makers. In this paper, a mathematical model...
متن کاملPrivacy-preserving Average Consensus: Privacy Analysis and Optimal Algorithm Design
The goal of the privacy-preserving average consensus (PPAC) is to guarantee the privacy of initial states and asymptotic consensus on the exact average of the initial value. This goal is achieved by an existing PPAC algorithm by adding and subtracting variance decaying and zero-sum random noises to the consensus process. However, there is lack of theoretical analysis to quantify the degree of t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Control of Network Systems
سال: 2019
ISSN: 2325-5870,2372-2533
DOI: 10.1109/tcns.2018.2863568